A Very Robust Auction Mechanism∗
نویسندگان
چکیده
A single unit of a good is to be sold by auction to one of many potential buyers. There are two equally likely states of the world. Potential buyers receive noisy signals of the state of the world. The accuracies of buyers ’ signals may differ. A buyer’s valuation is the sum of a common value component that depends on the state and an idiosyncratic private value component independent of the state. The seller knows nothing about the accuracies of the signals or about buyers’ beliefs about the accuracies. It is common knowledge among buyers that the accuracies of the signals are conditionally independent and uniformly bounded below 1 and above 1/2, and nothing more. We demonstrate a modified second price auction that has the property that, for any ε > 0, the seller’s expected revenue will be within ε of the highest buyer expected value when the number of buyers is sufficiently large and buyers make undominated bids.
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملOptimal Auction Design: Uncertainty, Robustness, and Revenue Maximization
Recent literature on robust mechanism design focuses on detail-free mechanisms to address issues on the restrictive common knowledge assumption. However, most of the existing studies focus on the implementability of an allocation mechanism in a more robust setting, whereas very little is known regarding how these formulations differ from the revenue perspective in the context of optimal mechani...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملOverview of Bergemann-Morris papers on Robust Mechanism Design
Since 1999, Dirk Bergemann and I have written a series of papers on "Robust Mechanism Design": 1. "Robust Mechanism Design." (Bergemann and Morris (2005)) 2. "Ex Post Implementation." (Bergemann and Morris (2008a)) 3. "Robust Implementation in Direct Mechanisms." (Bergemann and Morris (2009a)) 4. "An Ascending Auction for Interdependent Values." (Bergemann and Morris (2007)) 5. "The Role of the...
متن کاملAchieving Simultaneous Spectrum Utilization and Revenue Improvements in Practical Wireless Spectrum Auctions
Spectrum is a valuable, scarce and finite natural resource that is needed for many different applications, so efficient use of the scarce radio spectrum is important for accommodating the rapid growth of wireless communications. Spectrum auctions are one of the best-known market-based solutions to improve the efficiency of spectrum use. However, Spectrum auctions are fundamentally differen...
متن کاملLinear Programming for Mechanism Design: An Application to Bidder Collusion at First-Price Auctions
We demonstrate the use of linear programming techniques in the analysis of mechanism design problems. We use these techniques to analyze the extent to which a rst-price auction is robust to collusion when, contrary to some prior literature on collusion at rst-price auctions, the cartel cannot prevent its members from bidding at the auction. In this case, cartels have been shown to be less pro...
متن کامل